Formally Verified Transformation of Non-binary Constraints into Binary Constraints
نویسندگان
چکیده
It is well known in the Constraint Programming community that any non-binary constraint satisfaction problem (with finite domains) can be transformed into an equivalent binary one. One of most well-known translations Hidden Variable Encoding. In this paper we formalize encoding proof assistant Coq and prove solution makes it possible to build a original vice-versa. This formal development used complete formally verified solver developed by Carlier, Dubois Gotlieb 2012, making tool able solve n-ary problem, The key success connection between translator genericity latter.
منابع مشابه
Binary vs. non-binary constraints
There are two well known transformations from non-binary constraints to binary constraints applicable to constraint satisfaction problems (CSPs) with finite domains: the dual transformation and the hidden (variable) transformation. We perform a detailed formal comparison of these two transformations. Our comparison focuses on two backtracking algorithms that maintain a local consistency propert...
متن کاملDistributed Non-binary Constraints
Nowadays many real problems can be modeled as Constraint Satisfaction Problems (CSPs). In many situations, it is desirable to be able to state both hard constraints and soft constraints. Hard constraints must hold while soft constraints may be violated but as many as possible should be satisfied. Although the problem constraints can be divided into two groups, the order in which these constrain...
متن کاملNon-Binary Constraints
Since the origins of the constraint satisfaction paradigm, its restriction to binary constraints has concentrated a signiicant part of the work. This is understandable because new ideas/techniques are usually much simpler to present/ elaborate by rst restricting them to the binary case. (See for example the arc consistency algorithms, such as AC-3 or AC-4, which have been presented rst in their...
متن کاملBinary Heaps Formally Verified in Why3
The VACID-0 benchmarks is a set of small programs which pose challenges for formal verification of their functional behavior. This paper reports on the formal verification of one of these challenges: binary heaps. The solution given here is performed using the Why3 environment for program verification. The expected behavior of the program is specified in Why3 logic, structured using the constru...
متن کاملDomain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain filtering consistencies have been proposed. In this paper we present a detailed theoretical, algorithmic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-75333-7_7